Inductive Construction of Repletion

نویسنده

  • Thomas Streicher
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The role of feature construction in inductive rule learning

This paper proposes a unifying framework for inductive rule learning algorithms. We suggest that the problem of constructing an appropriate inductive hypothesis (set of rules) can be broken down in the following subtasks: rule construction, body construction, and feature construction. Each of these subtasks may have its own declarative bias, search strategies, and heuristics. In particular, we ...

متن کامل

Quotients of countably based spaces are not closed under sobrification

In this note we show that quotients of countably based spaces (qcb spaces) and topological predomains as introduced by M. Schröder and A. Simpson are not closed under sobrification. As a consequence replete topological predomains need not be sober, i.e. in general repletion is not given by sobrification. Our counterexample also shows that a certain tentative “equalizer construction” of repletio...

متن کامل

Braided Geometry and the Inductive Construction of Lie Algebras and Quantum Groups

Double-bosonisation associates to a braided group in the category of modules of a quantum group, a new quantum group. We announce the semiclassical version of this inductive construction.

متن کامل

Deductive and Inductive Methods for Program Synthesis

The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of deductive approach to program construction. An inductive method for program synthesis utilizing stochastic optimization algorithms is introduced to complement value propagation techniques.

متن کامل

Inductive Learning in Less Than One Sequential Data Scan

Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the number of sequential data scans. However, state-of-the-art decision tree construction algorithms still require multiple scans over the data set and use sophisticated control mechanisms and data structures. We first discus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Categorical Structures

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1999